an assembly flow-shop scheduling problem with sequence-dependent setup and transportation times
Authors
abstract
in this paper, three-stage assembly flowshop scheduling is considered with respect to minimizing bi-objectives, namely mean flow time and mean tardiness. this problem is a model of production systems, which several production operations are done simultaneously and independently, and then produced components are collected and transferred to an assembly stage for the final operation. in this model, by considering sequence-dependent setup time and components transformation times in order to make a real situation for the considered model, a lower bound (lb) is introduced to completion times of all the jobs. further, due dates are generated randomly in a determined interval for some examples. to validate the proposed model, the lingo 8.0 software and an enumeration technique that is coded in matlab are used. comparison between the results of the lingo 8.0 and enumeration technique shows that in larger problems (say n>8, where n is the number of jobs) the results obtained by lingo do not have the good efficiency and cannot be compared with the enumeration technique in terms of computational time and deviation from the minimum objective function. for example, in some large problems, the objective function values obtained by the lingo 8.0 software have 20% deviation from their minimum. therefore, to solve such a hard problem, a meta-heuristic method is required as future research.
similar resources
A bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption
full text
A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...
full textSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
full textSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
full textsolving group scheduling problem in no-wait flow shop with sequence dependent setup times
different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...
full textMinimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times
We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...
full textMy Resources
Save resource for easier access later
Journal title:
بین المللی مهندسی صنایع و مدیریت تولیدجلد ۲۱، شماره ۱، صفحات ۱۵-۲۳
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023